Tree decomposition

Results: 411



#Item
351Graph / Algebraic graph theory / Networks / Tree / Connectivity / Directed graph / Signed graph / Path decomposition / Graph theory / Mathematics / Network theory

Supporting Information Kemp and Tenenbaum[removed]pnas[removed]We describe our hypothesis space of structural forms in

Add to Reading List

Source URL: www.psy.cmu.edu

Language: English - Date: 2008-08-01 07:51:15
352Tree / Connectivity / Line graph / Max-flow min-cut theorem / Matching / Path decomposition / Planar separator theorem / Graph theory / Mathematics / Spanning tree

A normalization strategy for comparing tag count data

Add to Reading List

Source URL: www.ncbi.nlm.nih.gov

Language: English
353NP-complete problems / Graph operations / Path decomposition / Tree decomposition / Vertex / Feedback vertex set / Degree / Planar graph / Graph coloring / Graph theory / Theoretical computer science / Mathematics

Noname manuscript No. (will be inserted by the editor)

Add to Reading List

Source URL: www.csc.kth.se

Language: English - Date: 2011-10-14 09:00:21
354Tree / Graph / Chordal graph / Dual graph / Planar separator theorem / Path decomposition / Graph theory / Planar graphs / Outerplanar graph

Planar Separators and the Euclidean Norm Hillel Gazit*

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2007-11-16 18:13:27
355NP-complete problems / Graph operations / Tree decomposition / Minor / Parameterized complexity / Dominating set / Chordal graph / Equitable coloring / Clique / Graph theory / Theoretical computer science / Graph coloring

Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗

Add to Reading List

Source URL: www.kr.tuwien.ac.at

Language: English - Date: 2009-11-19 11:09:35
356Algebraic graph theory / Tree / Laplacian matrix / Edge contraction / Graph / Path decomposition / Adjacency matrix / Graph theory / Mathematics / Spanning tree

Topics in Graph Theory — Lecture Notes I (Tuesday) 1. Basics: Graphs and Spanning Trees Notation: G = (V, E) means that G is a graph with vertices V and edges E. Each edge e has either one

Add to Reading List

Source URL: www.math.ku.edu

Language: English - Date: 2004-08-10 22:04:59
357Universal graph / Tree decomposition / Minor / Chordal graph / Neighbourhood / Graph / Outerplanar graph / Path decomposition / Clique-sum / Graph theory / Graph operations / Planar graphs

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs Cyril Gavoille and Arnaud Labourel

Add to Reading List

Source URL: dept-info.labri.fr

Language: English - Date: 2007-08-07 09:06:34
358Minor / Tree / Graph / Chordal graph / Dual graph / Branch-decomposition / Petersen graph / Graph structure theorem / Graph theory / Planar graphs / Graph operations

New Upper Bounds on the Decomposability of Planar Graphs*

Add to Reading List

Source URL: users.uoa.gr

Language: English - Date: 2007-12-20 09:05:26
359Tree / Minor / End / Tree decomposition / Graph structure theorem / Graph theory / Spanning tree / Graph operations

Normal Spanning Trees, Aronszajn Trees and Excluded Minors Reinhard Diestel and Imre Leader

Add to Reading List

Source URL: www.math.uni-hamburg.de

Language: English - Date: 2007-04-04 07:33:20
360NP-complete problems / Graph coloring / Graph operations / Path decomposition / Tree decomposition / Connectivity / Graph / List coloring / Independent set / Graph theory / Theoretical computer science / Mathematics

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Daniel Lokshtanov∗

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2011-01-10 07:51:45
UPDATE